New results on the Zarankiewicz problem
نویسندگان
چکیده
منابع مشابه
On the Zarankiewicz Problem for Intersection Hypergraphs
Let d and t be fixed positive integers, and let K t,...,t denote the complete d-partite hypergraph with t vertices in each of its parts, whose hyperedges are the d-tuples of the vertex set with precisely one element from each part. According to a fundamental theorem of extremal hypergraph theory, due to Erdős [7], the number of hyperedges of a d-uniform hypergraph on n vertices that does not co...
متن کاملOn Zarankiewicz Problem and Depth-Two Superconcentrators
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of Kővári, Sós and Turán on the minimum number of edges in a bipartite graph that has no large independent set, and the theore...
متن کاملOn the half?half case of the Zarankiewicz problem
Consider the minimum number f(m,n) of zeroes in a 2m×2n (0, 1)-matrixM that contains no m×n submatrix of ones. This special case of the well-known Zarankiewicz problem was studied by Griggs and Ouyang, who showed, for m ≤ n, that 2n+m+1 ≤ f(m,n) ≤ 2n + 2m − gcd(m,n) + 1. The lower bound is sharp when m is fixed for all large n. They proposed determining limm→∞{f(m,m+ 1)/m}. In this paper, we sh...
متن کاملMore on a Problem of Zarankiewicz
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of Kővári, Sós and Turán on the minimum number of edges in a bipartite graph that has no large independent set, and the theore...
متن کاملSpectral Extrema for Graphs: The Zarankiewicz Problem
Let G be a graph on n vertices with spectral radius λ (this is the largest eigenvalue of the adjacency matrix of G). We show that if G does not contain the complete bipartite graph Kt,s as a subgraph, where 2 6 t 6 s, then λ 6 (
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.11.002